Semantics for Possibilistic Disjunctive Programs

Semantics for Possibilistic Disjunctive Programs

In this paper, a possibilistic disjunctive logic programming approach for modeling uncertain, incomplete and inconsistent information is defined. This approach introduces the use of possibilistic disjunctive clauses which are able to capture incomplete information and incomplete states of a knowledge base at the same time. By considering a possibilistic logic program as a possibilistic logic th...

Stable Semantics for Disjunctive Programs

[VG89b] A. Van Gelder. Negation as failure using tight derivations for general logic programs. [Prz91c] T. C. Przymusinski. Three-valued non-monotonic formalisms and semantics of logic programs. Journal of Articial Intelligence, 1991. (In print. Extended abstract appeared in: T. C. Przy-musinski. Three-valued non-monotonic formalisms and logic programming. [Ros89b] K. Ross. The well founded sem...

Paraconsistent Stable Semantics for Extended Disjunctive Programs

This paper presents declarative semantics of possibly inconsistent disjunctive logic programs. We introduce the paraconsistent minimal and stable model semantics for extended disjunctive programs, which can distinguish inconsistent information from others in a program. These semantics are based on lattice-structured multi-valued logics, and are characterized by a new xpoint semantics of extende...

Procedural Semantics for Fuzzy Disjunctive Programs

PStable Semantics for Possibilistic Logic Programs

Uncertain information is present in many real applications e.g., medical domain, weather forecast, etc. The most common approaches for leading with this information are based on probability however some times; it is difficult to find suitable probabilities about some events. In this paper, we present a possibilistic logic programming approach which is based on possibilistic logic and PStable se...